Determining Fuzzy Sets for Quantitative Attributes in Data Mining Problems
نویسنده
چکیده
The problem of mining association rules for fuzzy quantitative items was introduced and an algorithm proposed in [5]. However, the algorithm assumes that fuzzy sets are given. In this paper we propose a method to find the fuzzy sets for each quantitative attribute in a database by using clustering techniques. We present a scheme for finding the optimal partitioning of a data set during the clustering process regardless of the clustering algorithm used. More specifically, we present an approach for evaluation of clustering partitions so as to find the best number of clusters for each specific data set. This is based on a goodness index, which assesses the most compact and well-separated clusters. We use these clusters to classify each quantitative attribute into fuzzy sets and define their membership functions. These steps are combined into a concise algorithm for finding the fuzzy sets. Finally, we describe the results of using this approach to generate association rules from a real-life dataset. The results show that a higher number of interesting rules can be discovered, compared to partitioning the attribute values into equal-sized sets. Key-Words: association rules, fuzzy items, quantitative attributes, clustering
منابع مشابه
Designing a model of intuitionistic fuzzy VIKOR in multi-attribute group decision-making problems
Multiple attributes group decision making (MAGDM) is regarded as the process of determining the best feasible solution by a group of experts or decision makers according to the attributes that represent different effects. In assessing the performance of each alternative with respect to each attribute and the relative importance of the selected attributes, quantitative/qualitative evaluations ar...
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملOn the mining of fuzzy association rule using multi-objective genetic algorithms
The discovery of association rule acquire an imperative role in data mining since its inception, which tries to find correlation among the attributes in a database. Classical algorithms/procedures meant for Boolean data and they suffer from sharp boundary problem in handling quantitative data. Thereby fuzzy association rule (i.e., association rule based on fuzzy sets) with fuzzy minimum support...
متن کاملA Survey of Fuzzy Based Association Rule Mining to Find Co- Occurrence Relationships
Data mining is the analysis step of the "Knowledge Discovery in Databases" process, or KDD. It is the process that results in the discovery of new patterns in large data sets. It utilizes methods at the intersection of artificial intelligence, machine learning, statistics, and database systems. The overall goal of the data mining process is to extract knowledge from an existing data set and tra...
متن کاملGenetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy
Nowadays, discovery the association rules is an important and controversial area in data mining research studies. These rules, describe noticeable association relationships among different attributes. While most studies have focused on binary valued transaction data, in real world applications, there data usually consist of quantitative values. With that in mind, in this paper, we propose a fuz...
متن کامل